More on Wadge determinacy

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

More on Wadge determinacy

We show that the semi-linear ordering principle for continuous functions implies the determinacy of all Wadge and Lipschitz games. c © 2006 Elsevier B.V. All rights reserved.

متن کامل

The axiom of determinacy and the Wadge hierarchy

s for tutorials Alessandro Andretta, The axiom of determinacy and the Wadge hierarchy page 3 Martin Goldstern Real forcing page 3 Jouko Väänänen Set theory and model-theoretic logics page 4

متن کامل

Determinacy of Wadge classes and subsystems of second order arithmetic

In this paper we study the logical strength of the determinacy of infinite binary games in terms of second order arithmetic. We define new determinacy schemata inspired by the Wadge classes of Polish spaces and show the following equivalences over the system RCA0, which consists of the axioms of discrete ordered semi-ring with exponentiation, ∆1 comprehension and Π 0 0 induction, and which is k...

متن کامل

Corrigendum of “Determinacy of Wadge classes and subsystems of second order arithmetic”

for a pair (θ0(x), θ1(x)) of Π0 formulae such that, for all f ∈ {0, 1}N, ∀n(∃m > n)θ0(f [m]) if and only if ¬∀n∃m > nθ1(f [m]). We may assume that {s ∈ {0, 1}<N : θ0(s) ∧ θ1(s)} = ∅ and θ0(⟨⟩) by replacing θ0(x) with θ′ 0(x) ≡ (θ0(x) ∧ ¬θ1(x)) ∨ (x = ⟨⟩) and θ1(x) with θ′ 1(x) ≡ θ1(x) ∧ ¬θ0(x) ∧ (x ̸= ⟨⟩) if necessary. The above tree Tθ0,θ1 is well-founded, for if F were an infinite path of Tθ0,...

متن کامل

Determinacy of Wadge classes in the Baire space and simple iteration of inductive definition

In [4], we introduced determinacy schemata motivated by Wadge classes in descriptive set theory. In this paper, we prove that a simple iteration of Σ1 inductive definition implies Sep(∆ 0 2,Σ 0 2) determinacy in the Baire space over RCA0.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 2006

ISSN: 0168-0072

DOI: 10.1016/j.apal.2006.05.008